Search results for "Hermite interpolation"
showing 5 items of 5 documents
Discrete multiresolution based on hermite interpolation: computing derivatives
2004
Abstract Harten’s framework for multiresolution representation of data has been extended by Warming and Beam in [SIAM J. Sci. Comp. 22 (2000) 1269] to include Hermite interpolation. It needs the point-values of the derivative, which are usually unavailable, so they have to be approximated. In this work we show that the way in which the derivatives are approximated is crucial for the success of the method, and we present a new way to compute them that makes the scheme adequate for non-smooth data.
Hermite interpolation: The barycentric approach
1991
The barycentric formulas for polynomial and rational Hermite interpolation are derived; an efficient algorithm for the computation of these interpolants is developed. Some new interpolation principles based on rational interpolation are discussed.
Proving convexity preserving properties of interpolatory subdivision schemes through reconstruction operators
2013
We introduce a new approach towards proving convexity preserving properties for interpolatory subdivision schemes. Our approach is based on the relation between subdivision schemes and prediction operators within Harten's framework for multiresolution, and hinges on certain convexity properties of the reconstruction operator associated to prediction. Our results allow us to recover certain known results [10,8,1,7]. In addition, we are able to determine the necessary conditions for convexity preservation of the family of subdivision schemes based on the Hermite interpolation considered in [4].
Rational Hermite Interpolation and Quadrature
1993
Rational Hermite interpolation is used in two different ways in order to derive and analyze quadrature rules. One approach yields quadratures of Gaussian-type whereas the other one generalizes Engels’ dual quadratures exhibiting the close connection between rational Hermite interpolation and quadrature in general.